#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e3;
int arr[N];
int cmp(const void* e1, const void* e2)
{
	return *(int*)e1 - *(int*)e2;
}
int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	qsort(arr, n, sizeof(arr[0]),cmp);
	for (int i = 0; i < n; i++) {
		cout << arr[i] << " ";
	}
	return 0;
}